package ru.eas;

import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;

/**
 * @author aesipov
 */
public class OccurenceCount {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        int[] array = new int[n];
        for (int i = 0; i < array.length; i++) {
            array[i] = scanner.nextInt();
        }
//        int[] array = {2, 3, 9, 2, 2};
        System.out.println(alg(array) ? "True" : "False");
    }

    static boolean alg(int[] array) {
        Map<Integer, Integer> valueCounts = new HashMap<Integer, Integer>();
        for (int i = 0; i < array.length; i++) {
            int value = array[i];
            if (valueCounts.containsKey(value)) {
                valueCounts.put(value, valueCounts.get(value) + 1);
            } else {
                valueCounts.put(value, 1);
            }
        }
        int mostFrequantValue = array[0];
        for (int value : valueCounts.keySet()) {
            if (valueCounts.get(value) > valueCounts.get(mostFrequantValue)) {
                mostFrequantValue = value;
            }
        }
        return valueCounts.get(mostFrequantValue) > array.length / 2;
    }
}
